A Generalization of $D$- and $D_1$-Optimal Designs in Polynomial Regression
نویسندگان
چکیده
منابع مشابه
Constrained D-and D 1 -optimal Designs for Polynomial Regression
In the common polynomial regression model of degree m we consider the problem of determining the D-and D 1-optimal designs subject to certain constraints for the D 1-eeciencies in the models of degree m ? j; m ? j + 1; : : : ; m + k (m > j 0; k 0 given). We present a complete solution of these problems, which on the one hand allow a fast computation of the constrained optimal designs and on the...
متن کاملApproximate Optimal Designs for Multivariate Polynomial Regression
Abstract: We introduce a new approach aiming at computing approximate optimal designs for multivariate polynomial regressions on compact (semi-algebraic) design spaces. We use the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically the approximate optimal design problem. The geometry of the design is recovered via semidefinite programming duality theory. Th...
متن کاملD-optimal Designs for Wf Ighted Polynomial Regression--a Functi(jnal Approach
This paper is concerned with the problem of computing approximate D-optimal design for polynomial regression with analytic weight function on a interval [m0-a, mo+ a]. It is shown that the structure of the optimal design depends on a and weight function. Moreover, the optimal support points and weights are analytic functions of a at a = 0. We make use of a Taylor expansion to provide a recursiv...
متن کاملD-OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WITH WEIGHT FUNCTION x/(1 + x)
For polynomial regression with weight function x/(1 + x) for x ∈ [0, a], a polynomial is presented whose zeros are the support points of the D-optimal approximate design.
متن کاملGenerating exact D-optimal designs for polynomial models
This paper compares several optimization algorithms that can be used to generate exact D-optimal designs (i.e., designs for a specified number of runs) for any polynomial model. The merits and limitations of each algorithm are demonstrated on several low-order polynomial models, with numerical results verified against analytical results. The efficiencies – with respect to estimating model param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1990
ISSN: 0090-5364
DOI: 10.1214/aos/1176347878